منابع مشابه
On Quasihomogeneous Curves
A hypersurface is said to be quasihomogeneous if in suitable coordinates with assigned weights, its equation becomes weighted homogeneous in its variables. For an irreducible quasihomogeneous plane curve, the equation necessarily becomes a two term equation of the form aY n + bX where n,m are necessarily coprime. Zariski, in a short paper, established a criterion for an algebroid curve to be qu...
متن کاملOn the relations between the point spectrum of A and invertibility of I + f(A)B
Let A be a bounded linear operator on a Banach space X. We investigate the conditions of existing rank-one operator B such that I+f(A)B is invertible for every analytic function f on sigma(A). Also we compare the invariant subspaces of f(A)B and B. This work is motivated by an operator method on the Banach space ell^2 for solving some PDEs which is extended to general operator space under some ...
متن کاملQuasihomogeneous analytic affine connections on surfaces
We classify torsion-free real-analytic affine connections on compact oriented real-analytic surfaces which are locally homogeneous on a nontrivial open set, without being locally homogeneous on all of the surface. In particular, we prove that such connections exist. This classification relies in a local result that classifies germs of torsion-free real-analytic affine connections on a neighborh...
متن کاملAbsolutely Continuous Spectrum of a Schrödinger Operator on a Tree
We give sufficient conditions for the presence of the absolutely continuous spectrum of a Schrödinger operator on a regular rooted tree without loops (also called regular Bethe lattice or Cayley tree). Introduction and results The spectral properties of Schrödinger operators on graphs have numerous applications in physics and they have been intensively studied since late 90’s. We will be mainly...
متن کاملEmbedding a balanced binary tree on a bounded point set
Given an undirected planar graph G with n vertices and a set S of n points inside a simple polygon P , a point-set embedding of G on S is a planar drawing of G such that each vertex is mapped to a distinct point of S and the edges are polygonal chains surrounded by P . A special case of the embedding problem is that in which G is a balanced binary tree. In this paper, we present a new algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1991
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1991.147.231